Learning Geo-Contextual Embeddings for Commuting Flow Prediction
نویسندگان
چکیده
منابع مشابه
Learning Contextual Embeddings for Structural Semantic Similarity using Categorical Information
Tree kernels (TKs) and neural networks are two effective approaches for automatic feature engineering. In this paper, we combine them by modeling context word similarity in semantic TKs. This way, the latter can operate subtree matching by applying neural-based similarity on tree lexical nodes. We study how to learn representations for the words in context such that TKs can exploit more focused...
متن کاملLearning Policies for Contextual Submodular Prediction
Many prediction domains, such as ad placement, recommendation, trajectory prediction, and document summarization, require predicting a set or list of options. Such lists are often evaluated using submodular reward functions that measure both quality and diversity. We propose a simple, efficient, and provably near-optimal approach to optimizing such prediction problems based on noregret learning...
متن کاملDistributed Commuting Augmented Shortest Path Finding for Geo Spatial Datasets
Geo Spatial information is a large collection of datasets referring to the real world entities. Geo Spatial information has evolved in the last decade which led to produce a vast platform in Government Administration, Scientific Analysis and other various sectors especially in disaster management (DM), site suitability of Check-dams for Irrigation Department etc. It is required to obtain impera...
متن کاملLearning Policies for Contextual Submodular Prediction - Supplementary Material
Lemma 2. Let S be a set, and f a monotone submodular function defined on lists of items in S. Let A,B be any lists of items from S. Denote Aj the list of the first j items in A, U(B) the uniform distribution on items in B and define j = Es∼U(B)[f(Aj−1 ⊕ s)] − f(Aj), the additive error term in competing with the average marginal benefits of the items in B when picking the j item in A (which coul...
متن کاملOn Commuting Elements and Embeddings of Graph Groups and Monoids
We study commutation properties of subsets of right-angled Artin groups and trace monoids. We show that if Γ is any graph not containing a four-cycle without chords, then the group G(Γ) does not contain four elements whose commutation graph is a four-cycle; a consequence is that G(Γ) does not have a subgroup isomorphic to a direct product of non-abelian free groups. We also obtain corresponding...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the AAAI Conference on Artificial Intelligence
سال: 2020
ISSN: 2374-3468,2159-5399
DOI: 10.1609/aaai.v34i01.5425